Minimally Lexicalized Dependency Parsing
نویسندگان
چکیده
Dependency structures do not have the information of phrase categories in phrase structure grammar. Thus, dependency parsing relies heavily on the lexical information of words. This paper discusses our investigation into the effectiveness of lexicalization in dependency parsing. Specifically, by restricting the degree of lexicalization in the training phase of a parser, we examine the change in the accuracy of dependency relations. Experimental results indicate that minimal or low lexicalization is sufficient for parsing accuracy.
منابع مشابه
Learning Head-modifier Pairs to Improve Lexicalized Dependency Parsing on a Chinese Treebank
Due to the data sparseness problem, the lexical information from a treebank for a lexicalized parser could be insufficient. This paper proposes an approach to learn head-modifier pairs from a raw corpus, and to integrate them into a lexicalized dependency parser to parse a Chinese Treebank. Experimental results show that this approach not only enlarged the coverage of bi-lexical dependency, but...
متن کاملBootstrapping Lexicalized Models in Memory-Based Dependency Parsing
Previous research has shown that a lexicalized parsing model incorporating words but no parts-of-speech can outperform a model involving partsof-speech but no words given enough training data for supervised learning. We show that the same effect can be achieved with a bootstrapping approach, where a mixed model trained on a small treebank is used to parse a larger corpus which is used as traini...
متن کامل#238: Separating Surface Order and Syntactic Relations in a Dependency Grammar Topic Areas: L2. Syntax and Parsing under Consideration for Other Conferences (specify)? None #238: Separating Surface Order and Syntactic Relations in a Dependency Grammar
This paper proposes decoupling the dependency tree from word order, such that surface ordering is not determined by traversing the dependency tree. We develop the notion of a word order domain structure, which is linked but structurally dissimilar to the syntactic dependency tree. The proposal results in a lexicalized, declarative, and formally precise description of word order; features which ...
متن کاملChapter 1: Lexicalized PCFG: Parsing Czech
Recent work in statistical parsing of English has used lexicalized trees as a representation, and has exploited parameterizations that lead to probabilities directly associated with dependencies between pairs of words in the tree structure. Parsed corpora such as the Penn treebank have generally been sets of sentence/tree pairs: typically, hand-coded rules are used to assign head-words to each ...
متن کاملLexicalized Semi-incremental Dependency Parsing
Even leaving aside concerns of cognitive plausibility, incremental parsing is appealing for applications such as speech recognition and machine translation because it could allow for incorporating syntactic features into the decoding process without blowing up the search space. Yet, incremental parsing is often associated with greedy parsing decisions and intolerable loss of accuracy. Would the...
متن کامل